a utility-based data replication algorithm in large scale data grids

Authors

najme mansouri

young researchers and elite club, sirjan branch, islamic azad university, sirjan, iran

abstract

data grids support access to widely distributed storage for large numbers of users accessing potentially many files. to enhance access time, replication at nearby sites may be used. data replication, a technique much investigated bydata grid researchers in past years creates multiple replicas offile and places them in conventional locations to shorten fileaccess times. one of the problems in data replication iscreation of replicas, replica placement and replica selection. dynamic creation of replicas in an appropriate site by datareplication strategy can increase the systems performance.in this paper, we propose a data replication algorithm, called the utility-base data replication (udr) algorithm that improves file access time. each grid site has its own capabilities and characteristics; therefore, choosing one specific site from many sites that have the needed data is a key and significant decision. the replica selection problem has been studied by many researchers who only considered response time as a criterion for the selection process. therefore, in this study, we addressed the problem of how to select the best replica for the users' jobs. our approach is simulated using a data grid simulator, optorsim, developed by european data grid projects. comparing to the previous work the experimentation shows the improvement in the overall performance.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An Efficient Data Replication Strategy in Large-Scale Data Grid Environments Based on Availability and Popularity

The data grid technology, which uses the scale of the Internet to solve storage limitation for the huge amount of data, has become one of the hot research topics. Recently, data replication strategies have been widely employed in distributed environment to copy frequently accessed data in suitable sites. The primary purposes are shortening distance of file transmission and achieving files from ...

full text

Dynamic Replication based on Firefly Algorithm in Data Grid

In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...

full text

Branch replication scheme: A new model for data replication in large scale data grids

Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-onlymodel. These solutions require huge storage resources to store thewhole set of replicas and do not allow efficient data modification to avoid the consist...

full text

PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids

In recent years, grid technology has had such a fast growth that it has been used in many scientific experiments and research centers. A large number of storage elements and computational resources are combined to generate a grid which gives us shared access to extra computing power. In particular, data grid deals with data intensive applications and provides intensive resources across widely d...

full text

DECO: Data Replication and Execution CO-scheduling for Utility Grids

Vendor strategies to standardize grid computing as the IT backbone for service-oriented architectures have created business opportunities to offer grid as a utility service for compute and data– intensive applications. With this shift in focus, there is an emerging need to incorporate agreements that represent the QoS expectations (e.g. response time) of customer applications and the prices the...

full text

E2DR: Energy Efficient Data Replication in Data Grid

Abstract— Data grids are an important branch of gird computing which provide mechanisms for the management of large volumes of distributed data. Energy efficiency has recently emerged as a hot topic in large distributed systems. The development of computing systems is traditionally focused on performance improvements driven by the demand of client's applications in scientific and business domai...

full text

My Resources

Save resource for easier access later


Journal title:
journal of advances in computer research

جلد ۷، شماره ۴، صفحات ۷۹-۹۳

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023